The height of randomk-trees and related branching processes
نویسندگان
چکیده
منابع مشابه
The height of random k-trees and related branching processes
We consider the height of random k-trees and k-Apollonian networks. These random graphs are not really trees, but instead have a tree-like structure. The height will be the maximum distance of a vertex from the root. We show that w.h.p. the height of random k-trees and k-Apollonian networks is asymptotic to c log t, where t is the number of vertices, and c = c(k) is given as the solution to a t...
متن کاملthe evaluation of language related engagment and task related engagment with the purpose of investigating the effect of metatalk and task typology
abstract while task-based instruction is considered as the most effective way to learn a language in the related literature, it is oversimplified on various grounds. different variables may affect how students are engaged with not only the language but also with the task itself. the present study was conducted to investigate language and task related engagement on the basis of the task typolog...
15 صفحه اولRandom trees and general branching processes
We consider a tree that grows randomly in time. Each time a new vertex appears, it chooses exactly one of the existing vertices and attaches to it. The probability that the new vertex chooses vertex x is proportional to w(deg(x)), a weight function of the actual degree of x. The weight function w : N → R+ is the parameter of the model. In [4] and [11] the authors derive the asymptotic degree di...
متن کاملthe relationship between field-related cognitive styles and global reading comprehension of hypertext
this study investigates the relationship between field-related cognitive styles and global reading comprehension of hypertext. technically, field dependency is prevailing dominance of field on perception of parts, while global comprehension is skim-like reading to grasp the general content. in this research project, 60 senior and junior students of arak university majoring in english literature...
15 صفحه اولEnumerations of trees and forests related to branching processes and random walks
In a Galton-Watson branching process with o spring distribution (p0; p1; : : :) started with k individuals, the distribution of the total progeny is identical to the distribution of the rst passage time to k for a random walk started at 0 which takes steps of size j with probability pj+1 for j 1. The formula for this distribution is a probabilistic expression of the Lagrange inversion formula f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Random Structures & Algorithms
سال: 2014
ISSN: 1042-9832
DOI: 10.1002/rsa.20576